Poisson - gradient dynamical systems with convex potential
نویسنده
چکیده
The basic aim is to extend some results and concepts of nonautonomous second order differential systems with convex potentials to the new context of multi-time Poisson-gradient PDE systems with convex potential. In this sense, we prove that minimizers of a suitable action functional are multiple periodical solutions of a Dirichlet problem associated to the Euler-Lagrange equations. Automatically, these are solutions of the associated multi-time Hamiltonian equations. Mathematics Subject Classification: 35J50, 35J55.
منابع مشابه
A Mixed Method Poisson Solver for Three-dimensional Self-gravitating Astrophysical Fluid Dynamical Systems
SUMMARY A key ingredient in the simulation of self-gravitating astrophysical uid dynamical systems is the gravitational potential and its gradient. This paper focuses on the development of a mixed method multigrid solver of the Poisson equation formulated so that both the potential and the Cartesian components of its gradient are self-consistently and accurately generated. The method achieves t...
متن کاملNon-homogeneous continuous and discrete gradient systems: the quasi-convex case
In this paper, first we study the weak and strong convergence of solutions to the following first order nonhomogeneous gradient system $$begin{cases}-x'(t)=nablaphi(x(t))+f(t), text{a.e. on} (0,infty)\x(0)=x_0in Hend{cases}$$ to a critical point of $phi$, where $phi$ is a $C^1$ quasi-convex function on a real Hilbert space $H$ with ${rm Argmin}phineqvarnothing$ and $fin L^1(0...
متن کاملBarrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems
We study some continuous dynamical systems associated with constrained optimization problems. For that purpose, we introduce the concept of elliptic barrier operators and develop a unified framework to derive and analyze the associated class of gradient-like dynamical systems, called A-Driven Descent Method (A-DM). Prominent methods belonging to this class include several continuous descent met...
متن کاملEntropy of infinite systems and transformations
The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with ...
متن کاملGradient Descent Learns Linear Dynamical Systems
We prove that gradient descent efficiently converges to the global optimizer of the maximum likelihood objective of an unknown linear time-invariant dynamical system from a sequence of noisy observations generated by the system. Even though the objective function is non-convex, we provide polynomial running time and sample complexity bounds under strong but natural assumptions. Linear systems i...
متن کامل